On Interpretability of Almost Linear Orderings
نویسندگان
چکیده
منابع مشابه
on the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولAutomata on Linear Orderings
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these words. We prove that for countable scattered linear orderings, these two notions are equivalent. This result extends Kleene’s theorem.
متن کاملOn the Equimorphism Types of Linear Orderings
A linear ordering (also known as total ordering) embeds into another linear ordering if it is isomorphic to a subset of it. Two linear orderings are said to be equimorphic if they can be embedded in each other. This is an equivalence relation, and we call the equivalence classes equimorphism types. We analyze the structure of equimorphism types of linear orderings, which is partially ordered by...
متن کاملOn self-embeddings of computable linear orderings
The Dushnik–Miller Theorem states that every infinite countable linear ordering has a nontrivial self-embedding. We examine computability-theoretical aspects of this classical theorem.
متن کاملTree Automata and Automata on Linear Orderings
We show that the inclusion problem is decidable for rational languages of words indexed by scattered countable linear orderings. The method leans on a reduction to the decidability of the monadic second order theory of the infinite binary tree [9]. Mathematics Subject Classification. 68Q45, 03D05.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1998
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1039182249